TSTP Solution File: NUM688^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM688^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:16 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 38 ( 8 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 139 ( 16 ~; 11 |; 0 &; 106 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
z: nat ).
thf(decl_25,type,
u: nat ).
thf(decl_26,type,
more: nat > nat > $o ).
thf(decl_27,type,
pl: nat > nat > nat ).
thf(satz22b,conjecture,
more @ ( pl @ x @ z ) @ ( pl @ y @ u ),
file('/export/starexec/sandbox2/tmp/tmp.XPFcgbGUE7/E---3.1_26261.p',satz22b) ).
thf(n,axiom,
( ~ ( more @ z @ u )
=> ( z = u ) ),
file('/export/starexec/sandbox2/tmp/tmp.XPFcgbGUE7/E---3.1_26261.p',n) ).
thf(satz21,axiom,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( more @ X2 @ X3 )
=> ( ( more @ X4 @ X5 )
=> ( more @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XPFcgbGUE7/E---3.1_26261.p',satz21) ).
thf(m,axiom,
more @ x @ y,
file('/export/starexec/sandbox2/tmp/tmp.XPFcgbGUE7/E---3.1_26261.p',m) ).
thf(satz19h,axiom,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( X2 = X3 )
=> ( ( more @ X4 @ X5 )
=> ( more @ ( pl @ X4 @ X2 ) @ ( pl @ X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XPFcgbGUE7/E---3.1_26261.p',satz19h) ).
thf(c_0_5,negated_conjecture,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz22b])]) ).
thf(c_0_6,plain,
( ~ ( more @ z @ u )
=> ( z = u ) ),
inference(fof_simplification,[status(thm)],[n]) ).
thf(c_0_7,negated_conjecture,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X19: nat,X20: nat,X21: nat,X22: nat] :
( ~ ( more @ X19 @ X20 )
| ~ ( more @ X21 @ X22 )
| ( more @ ( pl @ X19 @ X21 ) @ ( pl @ X20 @ X22 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz21])])]) ).
thf(c_0_9,plain,
( ( more @ z @ u )
| ( z = u ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( more @ ( pl @ X2 @ X4 ) @ ( pl @ X3 @ X5 ) )
| ~ ( more @ X2 @ X3 )
| ~ ( more @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
more @ x @ y,
inference(split_conjunct,[status(thm)],[m]) ).
thf(c_0_13,plain,
( ( more @ z @ u )
| ( z = u ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
~ ( more @ z @ u ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
thf(c_0_15,plain,
! [X15: nat,X16: nat,X17: nat,X18: nat] :
( ( X15 != X16 )
| ~ ( more @ X17 @ X18 )
| ( more @ ( pl @ X17 @ X15 ) @ ( pl @ X18 @ X16 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19h])])]) ).
thf(c_0_16,plain,
z = u,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,plain,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( more @ ( pl @ X4 @ X2 ) @ ( pl @ X5 @ X3 ) )
| ( X2 != X3 )
| ~ ( more @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
~ ( more @ ( pl @ x @ u ) @ ( pl @ y @ u ) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
thf(c_0_19,plain,
! [X2: nat,X3: nat,X4: nat] :
( ( more @ ( pl @ X2 @ X3 ) @ ( pl @ X4 @ X3 ) )
| ~ ( more @ X2 @ X4 ) ),
inference(er,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM688^1 : TPTP v8.1.2. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 09:37:36 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.XPFcgbGUE7/E---3.1_26261.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.50 # sh4l with pid 26375 completed with status 0
% 0.20/0.50 # Result found by sh4l
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGUSF-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 26381 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGUSF-FFSF22-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 13
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 13
% 0.20/0.50 # Removed in clause preprocessing : 8
% 0.20/0.50 # Initial clauses in saturation : 5
% 0.20/0.50 # Processed clauses : 15
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 15
% 0.20/0.50 # Other redundant clauses eliminated : 1
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 1
% 0.20/0.50 # Generated clauses : 6
% 0.20/0.50 # ...of the previous two non-redundant : 5
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 4
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 1
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 3
% 0.20/0.50 # ...of those cached : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 7
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 2
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 7
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 15
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 587
% 0.20/0.50 # Search garbage collected termcells : 85
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.006 s
% 0.20/0.50 # Maximum resident set size: 1744 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1728 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------